Justi cation for Inclusion Dependency Normal Form
نویسندگان
چکیده
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. In this paper we address the issue of normalisation in the presence of FDs and INDs and in particular the semantic justiication for Inclusion Dependency Normal Form (IDNF), a normal form which combines Boyce-Codd normal form with the restriction on the INDs that they be noncircular and key-based. We motivate and formalise three goals of database design in the presence of FDs and INDs: non interaction between FDs and INDs, elimination of redundancy and update anomalies , and preservation of entity integrity. We show that, as for FDs, in the presence of INDs being free of redundancy is equivalent to being free of update anomalies. Then, for each of these properties we derive equivalent syntactic conditions on the database design. Individually, each of these syntactic conditions is weaker than IDNF and the restriction that an FD not be embedded in the right hand-side of an IND is common to three of the conditions. However, we also show that for these three goals of database design to be satissed simultaneously IDNF is both a necessary and suucient condition.
منابع مشابه
Justification for Inclusion Dependency Normal Form
ÐFunctional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. In this paper, we address the issue of normalization in the presence of FDs and INDs and, in particular, the semantic justification for Inclusion Dependency Normal Form (IDNF), a normal form which combines Boyce-Codd normal form with the...
متن کاملAn Overview of \Learning Goal Ontology"
Our research objectives include constructing a collaborative learning support system that detects appropriate situation for a learner to join in a collaborative learning session, and forms a collaborative learning group appropriate for the situation dynamically. In this paper, we describe the outline of a system of concepts concerning learning goals expected to attain by learners through collab...
متن کاملAn Iterative Heuristic for State Justi cation in Sequential Automatic Test Pattern Generation
State justi cation is one of the most timeconsuming tasks in sequential Automatic Test Pattern Generation (ATPG). For states that are diÆcult to justify, deterministic algorithms take signi cant CPU time without much success most of the time. In this work, we adopt a hybrid approach for state justication. A new method based on Genetic Algorithms is proposed, in which we engineer state justi cat...
متن کاملJustiied Plans and Ordered Hierarchies
The use of abstraction in problem solving is an e ective approach to reducing search, but nding good abstractions is a di cult problem. The rst attempt to automatically generate a hierarchy of abstraction spaces was made by Sacerdoti in 1974. In 1990 Knoblock built the system ALPINE, which completely automates the formation of a hierarchy by abstracting preconditions of operators. To formalize ...
متن کاملAn eight experiment sequence to determine reading equality
An eight experiment sequence was conducted to compare the speed and retention resulting from reading material. The text was justi®ed in each of four different ways: ragged-right (unjusti®ed); ®ll justi®ed; equal-®ll justi®ed; and micro-®ll justi®ed. Retention was measured by recall and by recognition tests. For reading time, only one signi®cant difference was found among the eight experiments. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999